Material for “ Learning the Network Structure of Heterogeneous Data via Pairwise Exponential Markov Random Fields ”

نویسندگان

  • Youngsuk Park
  • David Hallac
  • Stephen Boyd
  • Jure Leskovec
چکیده

where (b) holds by applying chain rule successively, and (c) holds because conditioning reduces entropy. Note that, for a known exponential family distribution, H(Xr | Br(X)) is constant. For examples in a Gaussian, Dirichlet, Gamma, Wishart, Xr is also a function of Br(Xr), meaning H(Xr | Br(X)) = 0. For a Laplacian distribution, H(Xr | Br(X)) = H(Sign(Xr)) = 1. Therefore, we can conclude that H(X) = H(bnode(X)) + C0 where C0 = ∑p r=1 H(Xr | Br(X)) is the constant determined by the types of nodes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning the Network Structure of Heterogeneous Data via Pairwise Exponential Markov Random Fields

Markov random fields (MRFs) are a useful tool for modeling relationships present in large and high-dimensional data. Often, this data comes from various sources and can have diverse distributions, for example a combination of numerical, binary, and categorical variables. Here, we define the pairwise exponential Markov random field (PE-MRF), an approach capable of modeling exponential family dis...

متن کامل

Learning Bayesian Network Structure using Markov Blanket in K2 Algorithm

‎A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG)‎. ‎There are basically two methods used for learning Bayesian network‎: ‎parameter-learning and structure-learning‎. ‎One of the most effective structure-learning methods is K2 algorithm‎. ‎Because the performance of the K2 algorithm depends on node...

متن کامل

Learning the Network Structure of Heterogenerous Data via Pairwise Exponential MRF

Markov random fields (MRFs) are a fundamental fool on data modeling. And the study on inferring the network structure (or Markov structure) has provoked an interested in many applications in machine learning. Often, it is necessary to model MRFs between heterogeneous entities, where the nodes in the graphical model can refer to different types of objects. For example, modeling medical patients ...

متن کامل

On Mixing in Pairwise Markov Random Fields with Application to Social Networks

We consider pairwise Markov random fields which have a number of important applications in statistical physics, image processing and machine learning such as Ising model and labeling problem to name a couple. Our own motivation comes from the need to produce synthetic models for social networks with attributes. First, we give conditions for rapid mixing of the associated Glauber dynamics and co...

متن کامل

Mixed Graphical Models via Exponential Families

Markov Random Fields, or undirected graphical models are widely used to model highdimensional multivariate data. Classical instances of these models, such as Gaussian Graphical and Ising Models, as well as recent extensions (Yang et al., 2012) to graphical models specified by univariate exponential families, assume all variables arise from the same distribution. Complex data from high-throughpu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017